Simulated annealing and genetic algorithm based method for a bi-level seru loading problem with worker assignment in seru production systems

Seru production is one of the latest manufacturing modes arising from Japanese practice. Seru can achieve efficiency, flexibility, and responsiveness simultaneously. To accommodate current business environment with volatile demands fierce competitions, seru has attracted more attention both researchers practitioners. A new planning management system, just-in-time organization system (JIT-OS), used to manage control a system. The JIT-OS contains two decisions: formation loading. By formation, or multiple appropriate serus configured; by loading, customer ordered products are allocated implement plans. In process workers have be assigned serus. this paper, loading problem worker assignment constructed as bi-level programming model, on upper level minimize total idle time while lower makespan finding out optimal product allocation. lot splitted different paper shown NP-hard. Therefore, simulated annealing genetic algorithm (SA-GA) developed. SA for GA programming. practicality effectiveness model verified numerical examples, results show that SA-GA good scalability.